Choosability in Random Hypergraphs
نویسندگان
چکیده
منابع مشابه
Choosability in Random Hypergraphs
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of color lists S = {S(v) : v ∈ V }, satisfying |S(v)| = s for every v ∈ V , there exists a choice function f so that f(v) ∈ S(v) for every v ∈ V , and no edge of H is monochromatic under f . In this paper we consider the asymptotic behavior of the choice number of a random k-uniform hypergraph H(k, n,...
متن کاملExchangeable random hypergraphs
A hypergraph is a generalization of a graph in which an edge may contain more than two vertices. Hereditary hypergraphs are particularly important because they arise in mathematics as the class of monotone subsets, in statistics as the class of factorial models, in topology as simplicial complexes and in algebra as the free distributive lattice. An exchangeable random hypergraph consists of a p...
متن کاملMonotone Paths in Random Hypergraphs
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N, the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.
متن کاملQuasi-random hypergraphs revisited
The quasi-random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k-graphs (i.e., k-uniform hypergraphs), an analogous quasi-random class contains various equivalent graph properties including the k-discrepancy property (bounding the number of edges in the generalized induced subgraph determined by an...
متن کاملRandom hypergraphs and algorithmics
Hypergraphs are structures that can be decomposed or described ; in otherwords they are recursively countable. Here, we get exact and asymptotic enumerationresults on hypergraphs by means of exponential generating functions. The number of hy-pergraph components is bounded, as a generalisation of Wright inequalities for graphs :the proof is a combinatorial understanding of the st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2001
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2053